Efficient Time and Volume DNA Simulation of CREW PRAM Algorithms
نویسندگان
چکیده
We present, in this paper, a detailed translation from algorithms implemented on a standard model of parallel computation — the CREW PRAM — to DNA-based methods. Our translation is efficient in the following sense: if A is a PRAM algorithm using P (n) processors, S (n) space, and taking T (n) time then the total volume of DNA used is O ( P (n) T (n) S (n) logS (n) ); furthermore, the total computation time of the DNA algorithm is bounded by O ( T (n) logS (n) ). As a consequence our methods give a direct translation from any NC algorithm into an effective DNA algorithm.
منابع مشابه
Efficient Geometric Algorithms on the EREW PRAM
We present a technique that can be used to obtain efficient parallel algorithms in the EREW-PRAM computational model. This technique enables us to optimally solve a number of geometric problems in O(logn) time using O(n/logn) EREW-PRAM processors, where n is the input size. These problerns include: computing the convex hull oCa sorted point set in the plane, computing the convex hull oCa simple...
متن کاملPercent Improvement for 3d Algorithms on 16k Processor Mp-1
We presented optimal direct warp algorithms for CREW and EREW PRAMs. 2D warping is important for image processing and graphics. 3D volume rotations are important for scientific visualization of voxel data. The EREW PRAM algorithm is restricted to nonscaling affine transforms, but is more efficient than the CREW algorithm in practice. The parallel run time complexity of both algorithms is using ...
متن کاملEfficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give several new parallel algorithms including O(lg3 n)-time and n/lgn-processor algorithms for solving the matrix chain ordering problem and for solving an optimal triangulation problem of convex polygons on the common CR...
متن کاملMore Efficient Parallel Totally Monotone Matrix Searching
We give a parallel algorithm for computing all row minima in a totally monotone n = n matrix which is simpler and more work efficient than previous polylog-time Ž . Ž . algorithms. It runs in O lg n lg lg n time doing O n lg n work on a CRCW ' 2 Ž Ž . . Ž . PRAM, in O lg n lg lg n time doing O n lg n work on a CREW PRAM, and in ' Ž . Ž . O lg n lg n lg lg n time doing O n lg n lg lg n work on a...
متن کاملEfficient Serial and Parallel Algorithms for Median Filtering
We develop a serial algorithm for separable median filtering that requires only two comparisons per element when the window size is three. In addition, fast parallel CREW PRAM algorithms with good processor-time product are developed for separable median filtering and two dimensional median filtering.
متن کامل